Statistical properties of finite sequences with high Kolmogorov complexity
نویسندگان
چکیده
منابع مشابه
Finite Inductive Sequences, Kolmogorov Complexity with Application to Genome Sequences
We describe current work in examining the complexity of genomic sequences at the amino acid level. We have provided an original algorithm description and research results when considering this algorithm as a measure of Kolmogorov complexity of such candidate strings. The results can be used to estimate comparative string values, identifying substrings with comparable values, and determining reg...
متن کاملKolmogorov complexity of enumerating finite sets
Solovay [5] has proved that the minimal length of a program enumerating a set A is upper bounded by 3 times the negative logarithm of the probability that a random program will enumerate A. It is unknown whether one can replace the constant 3 by a smaller constant. In this paper, we show that the constant 3 can be replaced by the constant 2 for finite sets A. We recall first two complexity meas...
متن کاملDiscussion on Kolmogorov Complexity and Statistical Analysis
The question why and how probability theory can be applied to the real-world phenomena has been discussed for several centuries. When the algorithmic information theory was created, it became possible to discuss these problems in a more specific way. In particular, Li and Vitányi [6], Rissanen [3], Wallace and Dowe [7] have discussed the connection between Kolmogorov (algorithmic) complexity an...
متن کاملAlgorithmic Complexity and Stochastic Properties of Finite Binary Sequences
This paper is a survey of concepts and results related to simple Kolmogorov complexity, prefix complexity and resource-bounded complexity. We also consider a new type of complexity— statistical complexity closely related to mathematical statistics. Unlike other discoverers of algorithmic complexity, A. N. Kolmogorov’s leading motive was developing on its basis a mathematical theory more adequat...
متن کاملKolmogorov Complexity with Error
We introduce the study of Kolmogorov complexity with error. For a metric d, we define Ca(x) to be the length of a shortest program p which prints a string y such that d(x, y) ≤ a. We also study a conditional version of this measure Ca,b(x|y) where the task is, given a string y′ such that d(y, y′) ≤ b, print a string x′ such that d(x, x′) ≤ a. This definition admits both a uniform measure, where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1994
ISSN: 0025-5661,1433-0490
DOI: 10.1007/bf01192146